Approximation by φ(ax) L(A, x) on finite point sets
نویسندگان
چکیده
منابع مشابه
Large simplices determined by finite point sets
Given a set P of n points in R, let d1 > d2 > . . . denote all distinct inter-point distances generated by point pairs in P . It was shown by Schur, Martini, Perles, and Kupitz that there is at most one d-dimensional regular simplex of edge length d1 whose every vertex belongs to P . We extend this result by showing that for any k the number of d-dimensional regular simplices of edge length dk ...
متن کاملPolygonal Approximation of Point Sets
Our domain of interest is polygonal (and polyhedral) approximation of point sets. Neither the order of data points nor the number of needed line segments (surface patches) are known. In particular, point sets can be obtained by laser range scanner mounted on a moving robot or given as edge pixels/voxels in digital images. Polygonal approximation of edge pixels can also be interpreted as groupin...
متن کاملOn the approximation of convex hulls of finite grid point sets
The outer or inner approximation of the convex hull of a grid point set may be used to speed up the feature extraction process in a shape analysis system. Some properties of these approximations are given.
متن کاملApproximation of Point Sets by 1-Corner Polygonal Chains
S everal problems on approximating geometric objects by polygonal chains have been studied by the computational geometry community due to its relevance to fields such as geographic information systems, pattern recognition and CAD/CAM. Some examples are the papers by Imai and Iri (1986, 1988), Toussaint (1985), Melkman and O’Rourke (1988), Chan and Chin (1996), and O’Rourke (1981). A lot of atte...
متن کاملSparse Approximation via Generating Point Sets
For a set P of n points in the unit ball b ⊆ Rd, consider the problem of finding a small subset T ⊆ P such that its convex-hull ε-approximates the convex-hull of the original set. Specifically, the Hausdorff distance between the convex hull of T and the convex hull of P should be at most ε. We present an efficient algorithm to compute such an ε′-approximation of size kalg, where ε′ is a functio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1977
ISSN: 0021-9045
DOI: 10.1016/0021-9045(77)90066-1